Flexible Tree Matching
نویسندگان
چکیده
Tree-matching problems arise in many computational domains. The literature provides several methods for creating correspondences between labeled trees; however, by definition, tree-matching algorithms rigidly preserve ancestry. That is, once two nodes have been placed in correspondence, their descendants must be matched as well. We introduce flexible tree matching, which relaxes this rigid requirement in favor of a tunable formulation in which the role of hierarchy can be controlled. We show that flexible tree matching is strongly NP-complete, give a stochastic approximation algorithm for the problem, and demonstrate how structured prediction techniques can learn the algorithm’s parameters from a set of example matchings. Finally, we present results from applying the method to tasks in Web design.
منابع مشابه
A Pattern Matching Compiler for Multiple Target Languages
Many processes can be seen as transformations of tree-like data structures. In compiler construction, for example, we continuously manipulate trees and perform tree transformations. This paper introduces a pattern matching compiler (Tom): a set of primitives which add pattern matching facilities to imperative languages such as C, Java, or Eiffel. We show that this tool is extremely non-intrusiv...
متن کاملTowards a flexible service discovery
─To support m-commerce applications, a service discovery mechanism where services can announce their presence and mobile users can locate these services is needed. Service discovery in dynamic mobile environments poses many challenges such as service providers may create and delete services or servers anytime; mobile services may be deployed in various forms, etc. In this paper, we propose a de...
متن کاملA Bit-Parallel Tree Matching Algorithm for Patterns with Horizontal VLDC's
The tree pattern matching problem is, given two labeled trees P and T , respectively called pattern tree and target tree, to find all occurrences of P within T . Many studies have been undertaken on this problem for both the cases of ordered and unordered trees. To realize flexible matching, a kind of variable-length-don’t-care’s (VLDC’s) have been introduced. In particular, the path-VLDC’s app...
متن کاملA Flexible Approach for Planning Schema Matching Algorithms
Most of the schemamatching tools are assembled frommultiple match algorithms, each employing a particular technique to improve matching accuracy and making matching systems extensible and customizable to a particular domain. The solutions provided by current schema matching tools consist in aggregating the results obtained by several match algorithms to improve the quality of the discovered mat...
متن کاملAn architecture for flexible service discovery in OCTOPUS
Service discovery has been drawing much attention from researchers and practitioners. The existing service discovery systems, like SLP, Jini, UPnP and Salutation, provide basic infrastructures where services can announce their presence and users can locate these services across the network. However there are several key issues which are partially solved or have not been well addressed such as s...
متن کامل